The Onto-Logical Translation Graph
نویسندگان
چکیده
We present an overview of the landscape of ontology languages, mostly pertaining to the first-order paradigm. In particular, we present a uniform formalisation of these languages based on the institution theoretical framework, allowing a systematic treatment and analysis of the translational relationships between the various languages and a general analysis of properties of such translations. We also discuss the importance of language translation from the point of view of ontological modularity and logical pluralism, and for the borrowing of tools and reasoners between languages.
منابع مشابه
A Translation-Based Knowledge Graph Embedding Preserving Logical Property of Relations
This paper proposes a novel translation-based knowledge graph embedding that preserves the logical properties of relations such as transitivity and symmetricity. The embedding space generated by existing translation-based embeddings do not represent transitive and symmetric relations precisely, because they ignore the role of entities in triples. Thus, we introduce a role-specific projection wh...
متن کاملApplication Mapping onto Network-on-Chip using Bypass Channel
Increasing the number of cores integrated on a chip and the problems of system on chips caused to emerge networks on chips. NoCs have features such as scalability and high performance. NoCs architecture provides communication infrastructure and in this way, the blocks were produced that their communication with each other made NoC. Due to increasing number of cores, the placement of the cores i...
متن کاملSynchronous Data Flow Simulation with MESSENGERS
Synchronous Dataflow(SDF) [5][6][7] model is widely used in signal processing design and simulation. SDF is a special case of dataflow. In SDF, a program is represented by a directed graph in which each vertex(actor) represents a computation, an edge specifies a FIFO buffer, and each actor produces (consumes) a fixed number of data values(tokens) onto(from) each output(input) edge per invocatio...
متن کاملIrregular Applications in Promoter (preprint)
Parallel computers with distributed memory are gaining popularity on account of their optimal scala-bility. However, their eecient use requires a locality-preserving mapping of the application's underlying logical graph structure onto the physical topology of the target platform. There are several possible ways to achieve this. PROMOTER is a parallel programming model which attempts this by mak...
متن کاملTranslation and Hybridity in Scenes and Frames Semantics
The present study is a theoretical attempt to illustrate how Fillmore's Scenes and Frames Semantics (SFS) could be employed as a framework to portray the process of understanding and translating hybrid texts. It first reviews the origin of SFS; then it maps SFS onto Nida’s linguistic model of translation process and the Interpretive Theory of Translation; it examines in the next section, withi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011